Decidability of Bisimilarity for One-Counter Processes
نویسندگان
چکیده
منابع مشابه
Decidability of Bisimilarity for One-Counter Processes
It is shown that bisimulation equivalence is decidable for the processes generated by (nondeterministic) pushdown automata where the pushdown behaves like a counter. Also niteness up to bisimilarity is shown to be decidable for the mentioned processes. 1 1 This paper is to appear in Information and Computation. The nal revisions were carried out while the author visited Uppsala university due t...
متن کاملDecidability of Bisimilarity for One-Counter Processes1
It is shown that bisimulation equivalence is decidable for the processes generated by (nondeterministic) pushdown automata where the pushdown behaves like a counter. Also niteness up to bisimilarity is shown to be decidable for the mentioned processes. 3
متن کاملThe complexity of bisimilarity-checking for one-counter processes
We study the problem of bisimilarity-checking between processes of one-counter automata and finite-state processes. We show that deciding weak bisimilarity between processes of one-counter nets (which are ‘restricted’ one-counter automata where the counter cannot be tested for zero) and finite-state processes is DP-hard. In particular, this means that the problem is both NP and co-NP hard. The ...
متن کاملBisimilarity of One-Counter Processes Is PSPACE-Complete
A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic one-counter automata (with no ε-steps) is in PSPACE. This improves the previously known decidability result (Jančar 2000), and matches the known PSPACE lower bound (Srba 2009). We add the PTIME-completeness result for deciding regularity (i.e...
متن کاملDecidability of Strong Bisimilarity for Timed BPP
We investigate a timed extension of the class of Basic Parallel Processes (BPP), in which actions are durational and urgent and parallel components have independent local clocks. The main result is decidability of strong bisimilarity, known also as performance equivalence, in this class. This extends the earlier decidability result for plain BPP [8] as well as decidability for timed BPP with st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2000
ISSN: 0890-5401
DOI: 10.1006/inco.1999.2813